Supporting Pruning in Tabled LP ? Pablo

This paper analyzes issues which appear when supporting pruning operations in tabled LP. A version of the once/1 control predicate tailored for tabled predicates is presented, and an implementation is discussed and evaluated. The use of once/1 with answer-on-demand strategies makes it possible to avoid computing unneeded solutions for problems which can benefit from tabled LP but in which only a single solution is needed, such as model checking and planning. The proposed version of once/1 is also directly applicable to the efficient implementation of other optimizations, such as early completion, cut-fail loops (to, e.g., perform pruning at the toplevel), if-then-else, and constraint-based branch-and-bound optimization. Although once/1 still presents open issues such as dependencies of tabled solutions on program history, our experimental evaluation confirms that it provides an arbitrarily large efficiency improvement in several application areas.